Flexible Zerotree Coding of Wavelet Coefficients
نویسندگان
چکیده
We introduce an extended EZW coder that uses flexible zerotree coding of wavelet coefficients. A flexible parentchild relationship is defined so as to exploit spatial dependencies within a subband as well as hierarchical dependencies among multi-scale subbands. The new relationship is based on a particular statistics that a large coefficient is more likely to have large coefficients in its neighborhood in terms of space and scale. In the flexible relationship, a parent coefficient in a subband relates to four child coefficients in the next finer subband in the same orientation. If each of the children is larger than a given threshold, the parent extends its parentship to the neighbors close to its conventional children. A probing bit is introduced to indicate whether a significant parent has significant children to be scanned. This enables us to avoid excessive scan of insignificant coefficients. Also, produced symbols are re-symbolized into simple variable-length binary codes to remove some redundancy according to a pre-defined rule. As a result, the wavelet coefficients can be described with a small number of binary symbols. This binary symbol stream gives a competitive performance without an additional entropy coding and thus a fast encoding/decoding is possible. Moreover, the binary symbols can be more compressed by an adaptive arithmetic coding. Our experimental results are given in both binary-coded mode and arithmetic-coded mode. Also, these results are compared with those of the EZW coder. key words: image compression, wavelet transform, zerotree coding
منابع مشابه
Zerotree Wavelet Coding Using Fractal Prediction
Fractal image coding can be seen as spectral prediction of coefficients in the wavelet decomposition of an image. Fine scale coefficients are described by shifted and scaled coefficients from the next coarser frequency scale. We analyzed the ability of fractal coders to predict wavelet coefficients and found that the prediction of entire wavelet subtrees-as done by conventional spatial domain f...
متن کاملOn Zerotree Quantization for Embedded Wavelet Packet Image Coding
Wavelet packets are an effective representation tool for adaptive waveform analysis of a given signal. We first combine the wavelet packet representation with zerotree quantization for image coding. A general zerotree structure is defined which can adapt itself to any arbitrary wavelet packet basis. We then describe an efficient coding algorithm based on this structure. Finally, the hypothesis ...
متن کاملQuantifying the Coding Performance of Zerotrees of Wavelet Coefficients: Degree-k Zerotree
Locating zerotrees in a wavelet transform allows encoding of sets of coefficients with a single symbol. It is an efficient means of coding if the overhead to identify the locations is small compared to the size of the zerotree sets on the average. It is advantageous in this regard to define classes of zerotrees according to the levels from the root until the remainder of the tree contains all z...
متن کاملZerotree Coding of Wavelet Coefficients for Image Data on Arbitrarily Shaped Support
A wavelet coding method for image data on arbitrarily shaped support applicable to the object-oriented coding of moving pictures, and to the efficient representation of texture data in computer graphics is proposed. Wavelet transform of arbitrarily shaped image is obtained by applying symmetrical extension technique at region boundaries and keeping the location of wavelet coefficient. For the e...
متن کاملOptimal 3-D coefficient tree structure for 3-D wavelet video coding
An optimal three-dimensional (3-D) coefficient tree structure for 3-D zerotree wavelet video coding is considered in this paper. The 3-D zerotree wavelet video coding is inspired by the success of the two-dimensional (2-D) zerotree wavelet image coding. Existing 3-D zerotree wavelet video codecs use the either symmetric or symmetric-alike 3-D tree structure, which is a straightforward extension...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999